例句與造句

1. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design . due to the limitation of computing complexity , an effective and efficient initial placement is very important for detailed placement . novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps . moreover , divide - and - conquer strategy and other simplified methods are adopted to minimize complexity . experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time
   文摘:以大規(guī)?；旌夏Ｊ讲季謫栴}為背景,提出了有效的初始詳細(xì)布局算法.在大規(guī)?；旌夏Ｊ讲季謫栴}中,由于受到計算復(fù)雜性的限制,有效的初始布局算法顯得非常重要.該算法采用網(wǎng)絡(luò)流方法來滿足行容量約束,采用線性布局策略解決單元重疊問題.同時,為解決大規(guī)模設(shè)計問題,整體上采用分治策略和簡化策略,有效地控制問題的規(guī)模,以時間開銷的少量增加換取線長的明顯改善.實驗結(jié)果表明該算法能夠取得比較好的效果,平均比paflo算法有16的線長改善,而cpu計算時間只有少量增加
2. Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically . this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do . an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength . test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
   文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調(diào)整布局方案的要求.與以前的以單元為中心的算法不同,算法基于單元行劃分來進(jìn)行單元的插入和位置調(diào)整,在此過程中使對原布局方案的影響最小,并且盡可能優(yōu)化線長.一組從美國工業(yè)界的測試?yán)颖砻?該算法運行速度快,調(diào)整后的布局效果好
3. A novel method of content - based image segmentation using deformable template matching is proposed . a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly . then the definitions of internal and external energy functions are given according to the image segmentation problem , and genetic algorithm is used to obtain globally optimal solutions . the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template . experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method
   本文提出一種采用可變形模板匹配技術(shù)進(jìn)行基于內(nèi)容的圖像分割算法.通過預(yù)先計算出可變形模板沿著變形的正交曲線，并對模板曲線及正交曲線進(jìn)行離散抽樣，建立一基于正交曲線的二維( 2 - d )可變形模板，針對圖像分割問題定義控制可變形模板進(jìn)行變形的內(nèi)、外部能量函數(shù)，本文采用遺傳算法搜索能量函數(shù)最小的全局最優(yōu)解.該新算法比傳統(tǒng)的可變形模板匹配方法降低了搜索空間的維數(shù)，減少了算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結(jié)果表明，新算法具有良好的分割精度及穩(wěn)定性
4. It's difficult to find initial placement in a sentence. 用initial placement造句挺難的